Rediscovering Rural Territories by Means of Religious Route Planning
نویسندگان
چکیده
منابع مشابه
Route Planning by Analogy
There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include information that may be relevant for the purpose of generating good realistic routes, including for example tra c patterns, construction, or number of lanes. Furthermore, the notion of a good route is dependent on a vari...
متن کاملEfficient Route Compression for Hybrid Route Planning
We describe an algorithmic framework for lossless compression of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed...
متن کاملSignal-Aware Route Planning
Modern vehicles have an increasing number of advanced features requiring network coverage in order to function properly. In order to facilitate the requirements of such features and allow more advanced applications, we consider the possibility of planning routes that take signal strength into consideration. Previous work have shown the relationship between TCP throughput/goodput and signal stre...
متن کاملSightseeing Route Planning
Route planning is a challenging task because it is a combination of theoretically well-defined computational problems on one side, and everyday-life decisions and constraints on the other side. This paper presents an approach to sightseeing route planning using theory of computation. In particular, in this paper we discuss the combination of two well-known computational problems: knapsack and t...
متن کاملEngineering Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-depend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sustainability
سال: 2017
ISSN: 2071-1050
DOI: 10.3390/su9030363